<HTML><HEAD><TITLE>graph_get_maxnode(+Graph, -MaxNode)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_get_maxnode(+Graph, -MaxNode)</H1>
Returns the highest node number in Graph
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>MaxNode</EM></DT>
<DD>an integer node number
</DD>
</DL>
<H2>Description</H2>
<P>
    Note that the smallest node number in a graph is always 1.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_get_maxnode(+, -) is det
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_get_all_edges-2.html">graph_get_all_edges / 2</A>, <A HREF="../../lib/graph_algorithms/graph_get_adjacent_edges-3.html">graph_get_adjacent_edges / 3</A>
</BODY></HTML>
